Automatic Proof Procedures for Polynomials and Special Functions
نویسندگان
چکیده
The key prior items of work are the MetiTarski theorem prover (Cambridge) and the RAHD decision procedure (Edinburgh). RAHD1 is a proof procedure for polynomials over the reals, and MetiTarski additionally is tailored for handling special functions such as log, exp, sin and cos. Both systems are well beyond the first prototype stage, and both have already shown world-leading characteristics [1, 2, 10, 20, 25, 24, 26]. However our experiments have also made us very aware of gap between their current capabilities and what is needed to support formal verification of hybrid systems – the primary application domain we are considering. Our previous work has thrown up a wealth of ideas for enhancing MetiTarski and RAHD, and we put forward this proposal as an opportunity to explore and realise these ideas. Further, we are very excited by the potential of a unified RAHD-MetiTarski system that combines the strengths of each. Hence we are not submitting two separate proposals, but rather this joint proposal to bring work on these two systems together.
منابع مشابه
Buckling and vibration analysis of angle -ply symmetric laminated composite plates with fully elastic boundaries
The main focus of this paper is on efficiency analysis of two kinds of approximating functions (characteristic orthogonal polynomials and characteristic beam functions) that have been applied in the Rayleigh-Ritz method to determine the non-dimensional buckling and frequency parameters of an angle ply symmetric laminated composite plate with fully elastic boundaries. It has been observed that o...
متن کاملInterpolation of the tabular functions with fuzzy input and fuzzy output
In this paper, rst a design is proposed for representing fuzzy polynomials withinput fuzzy and output fuzzy. Then, we sketch a constructive proof for existenceof such polynomial which can be fuzzy interpolation polynomial in a set given ofdiscrete points rather than a fuzzy function. Finally, to illustrate some numericalexamples are solved.
متن کاملBernstein's polynomials for convex functions and related results
In this paper we establish several polynomials similar to Bernstein's polynomials and several refinements of Hermite-Hadamard inequality for convex functions.
متن کاملPartial proof of Graham Higman's conjecture related to coset diagrams
Graham Higman has defined coset diagrams for PSL(2,ℤ). These diagrams are composed of fragments, and the fragments are further composed of two or more circuits. Q. Mushtaq has proved in 1983 that existence of a certain fragment γ of a coset diagram in a coset diagram is a polynomial f in ℤ[z]. Higman has conjectured that, the polynomials related to the fragments are monic and for a fixed degree...
متن کاملMultilinear generating functions for Charlier polynomials
Charlier configurations provide a combinatorial model for Charlier polynomials. We use this model to give a combinatorial proof of a multilinear generating function for Charlier polynomials. As special cases of the multilinear generating function, we obtain the bilinear generating function for Charlier polynomials and formulas for derangements.
متن کامل